Trust Models for RDF Data: Semantics and Complexity
نویسندگان
چکیده
Due to the openness and decentralization of the Web, mechanisms to represent and reason about the reliability of RDF data become essential. This paper embarks on a formal analysis of RDF data enriched with trust information by focusing on the characterization of its model-theoretic semantics and on the study of relevant reasoning problems. The impact of trust values on the computational complexity of well-known concepts related to the entailment of RDF graphs is studied. In particular, islands of tractability are identified for classes of acyclic and nearly-acyclic graphs. Moreover, an implementation of the framework and an experimental evaluation on real data are discussed.
منابع مشابه
The Meaning of Erasing in RDF under the Katsuno-Mendelzon Approach
The basic data model for the Semantic Web is RDF. In this paper we address updates in RDF. It is known that the semantics of updates for data models becomes unclear when the model turns, even slightly, more general than a simple relational structure. Using the framework of KatsunoMendelzon, we define a semantics for updates in RDF. Particularly we explore the behavior of this semantics for the ...
متن کاملA Fuzzy RDF Semantics to Represent Trust Metadata
The need for fuzzy knowledge bases arises from many application fields, such as trust management. To represent fuzzy data, a syntactic and semantic extension of RDF is proposed. The syntax adds to each triple a truth value. The semantic for Fuzzy RDF and Fuzzy RDF Schema allows to derive truth values for derived statements as well. Fuzzy RDF/RDFS does not aim to become a standard extension to p...
متن کاملQuerying Trust in RDF Data with tSPARQL
Today a large amount of RDF data is published on the Web. However, the openness of the Web and the ease to combine RDF data from different sources creates new challenges. The Web of data is missing a uniform way to assess and to query the trustworthiness of information. In this paper we present tSPARQL, a trust-aware extension to SPARQL. Two additional keywords enable users to describe trust re...
متن کاملLogical Foundations of (e)RDF(S): Complexity and Reasoning
An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms such as logic programming and description logics. In this paper we address this issue by considering embeddings of RDF and RDFS in logic. Using these embeddings, combined with existing results about various fragments of logic, ...
متن کاملTime - Space Trade-Offs in Scaling up RDF Schema Reasoning
A common way of reducing run time complexity of RDF Schema reasoning is to compute (parts of) the deductive closure of a model offline. This reduces the complexity at run time, but increases the space requirements and model maintenance because derivable facts have to be stored explicitly and checked for validity when the model is updated. In this paper we experimentally identify certain kinds o...
متن کامل